Quantum network routing and local complementation
نویسندگان
چکیده
منابع مشابه
Shortcuts to quantum network routing
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes...
متن کاملNetwork-Adaptive QoS Routing Using Local Information
In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP problem, we use CEA(Certainty Equivalency Approximation) technique that involves using the mean value of random variables, since it is intractable to determine the optimal solution. And we present a new path selection ...
متن کاملNetwork Formation and Routing by Strategic Agents Using Local Contracts
The Internet consists of various independent entities that range from small residential customers up to large backbone networks. The global network formation of the Internet is a result of the independent actions of these entities trying to achieve their individual connectivity needs balanced against their business goals. For example, customers accept contracts with ISPs to connect them to the ...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملAn Effective Local Routing Strategy on the Communication Network
In this paper, we propose an effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential cut-off exponent K. We assume that the handling capacity of one vertex is proportional to its degree when the degree is smaller than K, and is a constantC0 otherwise. It is found that by tuning the parameter α, the scale-free network capacity measu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: npj Quantum Information
سال: 2019
ISSN: 2056-6387
DOI: 10.1038/s41534-019-0191-6